2006년 컴퓨터종합학술대회
Current Result Document :
| 한글제목(Korean Title) |
Monitoring Continuous k-Nearest Neighbor Queries using c-MBR |
| 영문제목(English Title) |
Monitoring Continuous k-Nearest Neighbor Queries using c-MBR |
| 저자(Author) |
HaRim Jung
Sang-Won Kang
MoonBae Song
SeokJin Im
Jongwan Kim
Chong-Sun Hwang
|
| 원문수록처(Citation) |
VOL 33 NO. 01 PP. 0046 ~ 0048 (2006. 06) |
한글내용
(Korean Abstract) |
|
영문내용
(English Abstract) |
This paper addresses the problem of monitoring continuous k-nearest neighbor (k-NN) queries. Given a set of moving (or static) objects and a set of moving (or static) query points, monitoring continuous k-NN query retrieves and updates the closest k objects to a query point continually. In order to support location based services (LBSs) in highly dynamic environments, where objects and/or queries are frequently moving, monitoring continuous queries require real-time updated results when objects and/or queries change their locations. Thus, it is important to minimize time delay for maintaining up to date the results. In this paper, we present monitoring method to shorten time delay for updating continuous k-NN queries based on the notion of result region and the minimum bounding rectangle enclosing all objects in each cell, referred to as c-MBR, in the grid index structure. Simulations are conducted to show the efficiency of the proposed method.
|
| 키워드(Keyword) |
|
| 파일첨부 |
PDF 다운로드
|
